Dimension/length profiles and trellis complexity of linear block codes
نویسندگان
چکیده
منابع مشابه
Dimension/length profiles and trellis complexity of linear block codes
This semi-tutorial paper discusses the connections between the dimension/length profile (DLP) of a linear code, which is essentially the same as its " generalized Hamming weight hierarchy " 111, and the complexity of its minimal trellis diagram. These connections are close andtdeep. DLP duality is closely related to trellis duality. The DLP of a code gives tight bounds on its state and branch c...
متن کاملTrellis decoding complexity of linear block codes
AbstructIn this partially tutorial paper, we examine minimal trellis representations of linear block codes and analyze several measures of trellis complexity: maximum state and edge dimensions, total span length, and total vertices, edges and mergers. We obtain bounds on these complexities as extensions of well-known dimensiodlength profile (DLP) bounds. Codes meeting these bounds minimize all ...
متن کاملOn complexity of trellis structure of linear block codes
This paper is concerned with the trellis structure of linear block codes. The paper consists of four parts. In the first part, we investigate the state and branch complexities of a trellis diagram for a linear block code. A trellis diagram with the minimum number of states is said to be minimal. First, we express the branch complexity of a minimal trellis diagram for a linear block code in term...
متن کاملTrellis Complexity Bounds for Decoding Linear Block Codes
We consider the problem of finding a trellis for a finear block code that minimizes one or more measures of trellis complexity. The domain of optimization may be different permutations of the same code or different codes with the same parameters. Constraints on trellises, including relationships between the minimal trellis of a code and that of the dual code, are used to derive bounds on comple...
متن کاملTrellis Representations for Linear Block Codes
Trellis Representations for Linear Block Codes Heide Gluesing-Luerssen University of Kentucky Department of Mathematics 715 Patterson Office Tower Lexington, KY 40506 USA During the last decade conventional and tail-biting trellis representations of linear block codes have gained a great deal of attention. A tail-biting trellis for a block code of length n is an edge-labeled layered graph on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1994
ISSN: 0018-9448
DOI: 10.1109/18.340452